a meta heuristic algorithms based on ant colony system for solving multi depots location-routing problem with multiple using of vehicle

نویسندگان

مریم رضوی

دانشجوی کارشناسی ارشد مدیریت صنعتی تحقیق در عملیات، دانشگاه شیراز، ایران محمدعلی سوخکیان

استادیار بخش مدیریت و حسابداری، دانشگاه شیراز، ایران کورش زیارتی

استادیار بخش مهندسی و علوم کامپیوتر، دانشکده مهندسی دانشگاه شیراز، ایران

چکیده

in a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. the location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. because of the complexity and the time consuming computation, this problem belongs to a class of combinatorial optimization and np-hard problems. finding an optimal solution for this type of complex, huge problem in reasonable computational time by using traditional and exact approaches and optimization tools is very difficult. so a meta heuristic algorithm based on ant colony system is proposed to solve this problem. according to the experiments, this proposed algorithm reports near-optimal and promising solutions in reasonable time. also in this paper the assumption of assigning several routes to a vehicle during its available time is considered. finally, the computational results obtained by this algorithm are compared with the results reported by lingo software.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Phase Meta-Heuristic for Multi-Depots Vehicle Routing Problem

In this work, we present a multi-phase hybrid algorithm based on clustering to solve the multi-depots vehicle routing problem (MDVRP). The proposed algorithm initially adopts K-means algorithm to execute the clustering analyses, which take the depots as the centroids of the clusters, for the all customers of MDVRP, then implements the local depth search using the Shuffled Frog Leaping Algorithm...

متن کامل

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...

متن کامل

Solving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

متن کامل

A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehi...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023